Gossiping Nets
نویسندگان
چکیده
The question of how the human mind works and what the basis of its admirable capabilities is probably goes back to the first human who thought about how the very act of thinking comes about. In the meantime, psychologists have acquired plenty of material on human behavior, learning, and perception, while physiologists have uncovered an immense collection of properties of nerve cells and the structures they form in the brain. Starting with a paper by McCulloch and Pitts [1] these biological findings have been abstracted to a series of simplified models, which can be defined in mathematical terms and studied in their own right. According to this model, the brain is “nothing but” a set of simple elements interconnected to a huge graph with some laws governing the time course of the distribution of activity across the elements. Some of the elements are connected to sensors like eyes or ears and are considered input, others are attached to muscles and are considered output. For simplicity, the elements are called neurons, the graphs they form “neural networks” or “neural nets”. Since 1946, this basic idea has been followed, refined, tested and put to use. It turned out that the “nothing but” is a huge euphemism, both because the model is much too simple to cover the biological properties of a brain and even small neural networks can be extremely complicated systems. As for the question of how the mind works, many more open questions have been raised than definitive answers given. Formalized systems have been studied in considerable detail and some of them have become standard tools in statistics, control theory, and computer science. Researchers working on this idea found themselves in the situation that no academic discipline was really responsible for their research and some even rejected it quite fiercely. Consequently, the now established research discipline of Neurocomputing continues to have strong influences from electrical engineering, mathematics, computer science, psychology, neurobiology, and physiology. Clearly the development of such a field cannot proceed without tension.
منابع مشابه
Gossiping with Bounded Size Messages in ad hoc Radio Networks
We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n)-gossiping. We show that √ n-gossiping in an ad hoc radio network on...
متن کاملTime and Cost Trade-Offs in Gossiping
Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of efficiency of a gossiping algo...
متن کاملNew bounds on the minimum calls of failure-tolerant gossiping
Gossiping is an extensively investigated information dissemination process. In gossiping, every vertex holds a message which has to be transmitted to all other vertices. This paper deals with k-failure tolerant gossiping, which investigates the minimum number of transmissions (calls) required by the communication process, provided that at most k transmissions may fail. We show new bounds for th...
متن کاملAnonymous Gossiping
In this paper we introduce a novel gossiping primitive to support privacy preserving data analytics (PPDA). In contrast to existing computational PPDA primitives such as secure multiparty computation and data randomization based approaches, the proposed primitive “anonymous gossiping” is a communication primitive for privacy preserving personalized information aggregation complementing such tra...
متن کاملApproximation algorithms for information dissemination problems
Broadcasting and gossiping are known to be NP hard problems This paper deals with approximation algorithms for such problems We consider both round complexity and step complexity in the telephone model After an overview of previously derived approximation algorithms we present new strategies for broadcasting and gossiping in any graphs Broadcasting strategies are based on the construction of ed...
متن کاملTime and Cost Trade-oos in Gossiping
Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of eeciency of a gossiping algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999